Distributed Universal Adaptive Networks

نویسندگان

چکیده

Adaptive networks (ANs) are effective real time techniques to process and track events observed by sensor and, more recently, equip Internet of Things (IoT) applications. ANs operate over nodes equipped with collaborative adaptive filters that solve distributively an estimation problem common the whole network. However, they do not guarantee lose from cooperation, as compared its non-cooperative operation; poor rejected exceptional estimates reach entire network; performance is uniform all nodes. In order enforce such properties, this work introduces concept distributed universal estimation, which encompasses new concepts local universality, global universality respect operation. We then construct a cooperation protocol proven be universal, outperforming direct competitors literature, shown several simulations. Mean mean-square analytical models developed, good agreement between theory

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Distributed Incremental Least Mean-Square for Parameter Estimation using Heterogeneous Adaptive Networks in Unreliable Measurements

Adaptive networks include a set of nodes with adaptation and learning abilities for modeling various types of self-organized and complex activities encountered in the real world. This paper presents the effect of heterogeneously distributed incremental LMS algorithm with ideal links on the quality of unknown parameter estimation. In heterogeneous adaptive networks, a fraction of the nodes, defi...

متن کامل

Tracking performance of incremental LMS algorithm over adaptive distributed sensor networks

in this paper we focus on the tracking performance of incremental adaptive LMS algorithm in an adaptive network. For this reason we consider the unknown weight vector to be a time varying sequence. First we analyze the performance of network in tracking a time varying weight vector and then we explain the estimation of Rayleigh fading channel through a random walk model. Closed form relations a...

متن کامل

Distributed Optimization in Adaptive Networks

We develop a protocol for optimizing dynamic behavior of a network of simple electronic components, such as a sensor network, an ad hoc network of mobile devices, or a network of communication switches. This protocol requires only local communication and simple computations which are distributed among devices. The protocol is scalable to large networks. As a motivating example, we discuss a pro...

متن کامل

Distributed Adaptive Routing in Wireless Adhoc Networks

An ad-hoc network of wireless static nodes is considered as it arises in a rapidly deployed, sensor based, monitoring system. Information is generated in certain nodes and needs to reach some designated gateway node. Each node may adjust its power within a certain range that determines the set of possible one hop away neighbours. Traffic forwarding through multiple hops is employed when the int...

متن کامل

Distributed Optimization in Adaptive Networks: Appendix

1 Markov Decision Processes Consider a Markov chain (w(k), a(k)) defined for k = 0, 1,. .. and with w(k) ∈ W, a(k) in A, where W and A are finite sets representing the system state space and the action space, respectively. The transition probabilities are defined by the function P θ (w , a , w, a) = Pr w(k + 1) = w, a(k + 1) = a| w(k) = w , a(k) = a. Here, θ ∈ R N is a vector of policy paramete...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Signal Processing

سال: 2023

ISSN: ['1053-587X', '1941-0476']

DOI: https://doi.org/10.1109/tsp.2023.3275812